Ramsey's theorem - PDFSEARCH.IO - Document Search Engine

Ramsey's theorem
Results: 20

#	Item
11	Ramsey Theory Contents 1 Monochromatic systems 1 Ramsey’s Theorem . . . . . . Add to Reading List Source URL: dl.dropboxusercontent.com Language: English
12	Flat covers: The direct method Wolfgang Rump 1. An additive Ramsey theorem Let K be an infinite complete graph with red and green edges. Ramsey’s theorem states that there Add to Reading List Source URL: www.iaz.uni-stuttgart.de Language: English - Date: 2011-04-18 04:45:00
13	RAMSEY’S THEOREM FOR PAIRS AND PROVABLY RECURSIVE FUNCTIONS ALEXANDER KREUZER AND ULRICH KOHLENBACH Abstract. This paper addresses the strength of Ramsey’s theorem for pairs (RT22 ) over a weak base theory from the p Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2009-07-12 17:28:13
14	Ramsey’s theorem for pairs and provable recursive functions Alexander Kreuzer (joint work with Ulrich Kohlenbach) TU Darmstadt Logic Colloquium 2009 Add to Reading List Source URL: www.math.nus.edu.sg Language: English
15	Ramsey’s theorem for pairs and program extraction Alexander P. Kreuzer TU Darmstadt New Orleans, January 2011 Add to Reading List Source URL: www.math.nus.edu.sg Language: English
16	FIM Nachdiplomvorlesung Regularity Methods in Combinatorics Abstract: Szemerédi‘s regularity lemma provides a rough Add to Reading List Source URL: www.fim.math.ethz.ch Language: English - Date: 2015-02-02 07:10:47 Lemmas Szemerédi regularity lemma Ramsey theory Additive combinatorics Additive number theory Green–Tao theorem Endre Szemerédi Prime number Mathematics Combinatorics Graph theory
17	RAMSEY’S THEOREM AND CONE AVOIDANCE DAMIR D. DZHAFAROV AND CARL G. JOCKUSCH, JR. Abstract. It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low2 homogeneous set Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:59:20 Logic Theory of computation Congruence lattice problem Mathematics Computability theory Forcing
18	ERRATA FOR “ON THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS” PETER A. CHOLAK, CARL G. JOCKUSCH, JR., AND THEODORE A. SLAMAN Several proofs given in [2] contain significant errors or gaps, although Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-08-16 22:19:13 Year of birth missing Turing degree Mathematics Mathematical logic Logic Proof theory Computability theory Carl Jockusch Place of birth missing
19	THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO RAMSEY’S THEOREM FOR PAIRS DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., BJØRN KJOS-HANSSEN, STEFFEN LEMPP, AND THEODORE A. SLAMAN Abstract. We study the reverse Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:55:43 Mathematics Theory of computation PA degree Computable function Reverse mathematics Model theory Forcing Combinatory logic Primitive recursive function Computability theory Mathematical logic Theoretical computer science
20	RADO’S SINGLE EQUATION THEOREM REU SUMMER 2005 Add to Reading List Source URL: www.math.uga.edu Language: English - Date: 2005-06-13 13:51:24 Numerical linear algebra System of linear equations Ordinary differential equations Ramsey theory Mathematics Linear algebra Equations

UPDATE